Simulating Turing machines on Maurer machines

نویسندگان

  • Jan A. Bergstra
  • Kees Middelburg
چکیده

In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simulate Turing machines on a Maurer machine which, dissenting from the classical theory of computability, take into account that in reality computations always take place on finite machines. In one of those ways, multi-threads and thread forking have an interesting theoretical application.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

On Transformations of Load-Store Maurer Instruction Set Architectures

Maurer proposes a model for computers from the viewpoint of general function and set theory in [W.D66, W.D06]. Mathematical machines (Turing machines, push-down automata, etc.) are widely known for their inadequate representation of modern computers, but Maurer’s model gives a leading solution. Maurer machines [JC07a], introduced by Bergstra and Middelburg, are based on this model and basic thr...

متن کامل

On Transformations of Load-Store Maurer Instruction Set Architecture

Maurer proposes a model for computers from the viewpoint of general function and set theory in [7, 8]. Mathematical machines (Turing machines, push-down automata, etc.) are widely known for their inadequate representation of modern computers, but Maurer’s model gives a leading solution. Maurer machines [1], introduced by Bergstra and Middelburg, are based on this model and basic thread algebra ...

متن کامل

The difference between Clocks and Turing Machines1

Content: 1. Clocks and Logic. 2. Turing Machines and the distinction between Hardware and Software 3. Simulating Turing Machines by Clocks. 4. Finite representations in Physics and in Metamathematics. 5. Mathematics as an open system. 6. Interactive, asynchronous and distributed computing. 7. Plasticity and the wet brain. 8. Implicit Mathematics APPENDIX: More on the proofs of unprovable propos...

متن کامل

Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines

As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Applied Logic

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2008